Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies
نویسندگان
چکیده
Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system M [X]|G|1〈L,H〉|〈H,R〉 with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode) is presented. Numerical examples that allow comparison of the efficiency of both policies are given.
منابع مشابه
An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals
Shanthikumar [10] studied the priority M/G/1 queue with server vacations and found that the difference between the waiting time distribution under the non-preemptive priority and that under the preemptive-resume priority is independent of the vacation policy. We extend this interesting property i) to the generalized vacations which includes the two vacation policies considered by Shanthikumar, ...
متن کاملAn M/g/1 Retrial Queue with Unreliable Server and Vacations
In this paper, we consider retrial queueing systems with batch arrivals in which the server is subject to controllable interruptions (called vacations) and random interruptions (breakdowns). No specific assumption is taken regarding probability distributions of parametric random variables. The purpose of this work is to show effect of above mentioned parameters (in particular retrial and breakd...
متن کاملA discrete - time Geo [ X ] / G / 1 retrial queue with control of admission
This paper analyses a discrete-time Geo/G/1 retrial queue with batch arrivals in which individual arriving customers have a control of admission. We study the underlying Markov chain at the epochs immediately after the slot boundaries making emphasis on the computation of its steady-state distribution. To this end we employ numerical inversion and maximum entropy techniques. We also establish a...
متن کاملConcavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals
For an M/G/1 processor-sharing queue with batch arrivals, Avrachenkov et al. [1] conjectured that the conditional mean sojourn time is concave. However, Kim and Kim [5] showed that this conjecture is not true in general. In this paper, we show that this conjecture is true if the service times have a hyperexponential distribution.
متن کاملAnalysis of unreliable bulk queue with statedependent arrivals
In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computer Science
دوره 24 شماره
صفحات -
تاریخ انتشار 2014